Enumeration of Integral Tetrahedra
نویسنده
چکیده
We determine the numbers of integral tetrahedra with diameter d up to isomorphism for all d ≤ 1000 via computer enumeration. Therefore we give an algorithm that enumerates the integral tetrahedra with diameter at most d in O(d5) time and an algorithm that can check the canonicity of a given integral tetrahedron with at most 6 integer comparisons. For the number of isomorphism classes of integral 4 × 4 matrices with diameter d fulfilling the triangle inequalities we derive an exact formula.
منابع مشابه
GLY Conjecture on Counting number of integral points in a general n-dimensional tetrahedra
Recently there has been tremendous interest in counting the number of integral points in n-dimensional tetrahedra with non-integral vertice due to its applications in primality testing and factoring in number theory and in singularities theory. The purpose of this paper is to summarize our previous works. A conjecture on sharp upper estimate of the number of integral points in n-dimensional tet...
متن کاملCounting Gluings of Octahedra
Three–dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the notion of two–dimensional 2p–angulations to three dimensions in a way which is suitable for combinatorics and enumeration. In particular, universality classes...
متن کاملEnumerating combinatorial triangulations of the hexahedron
Most indirect hexahedral meshing methods rely on 10 patterns of subdivision of the hexahedron into tetrahedra. A recent observation at least one more pattern exists raise the question of the actual number of subdivisions of the hexahedron into tetrahedra. In this article answers we enumerate these subdivisions by exhausting all possible ways to combine tetrahedra into hexahedra. We introduce a ...
متن کاملA remark on asymptotic enumeration of highest weights in tensor powers of a representation
We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...
متن کاملInvariants of multidimensional time series based on their iterated-integral signature
3 General linear group 5 3.1 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 The case d arbitrary, w = 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.3 The case d = 2, w = 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.4 The case d = 3, w = 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007